1
کامپیوتر و شبکه::
مرکز خوشه
Figure 2.2 Initial cluster centers placed
In k-means clustering, dancers are assigned to the cluster that's nearest them, so between any two cluster centers on the floor, you can draw a line of demarcation, whereby if a dancer is on one side of the line they're in one group, but if they're on the other side, their group changes (see Figure 2.3).
This diagram, one that divides the space into polytopes based on which regions are assigned to which cluster centers by distance, is called a Voronoi diagram.
The k-means clustering algorithm slides these three cluster centers around the dance floor until it gets the best fit.
Well, each attendee is some distance away from their cluster center.
واژگان شبکه مترجمین ایران